Chaos Mosaic: Fast and Memory Efficient Texture Synthesis

نویسندگان

  • Ying-Qing XU
  • Baining GUO
  • Harry SHUM
چکیده

We present a procedural method for synthesizing large textures from an input texture sample. The basis of our algorithm is the chaos mosaic, a technique for synthesizing textures with an even and visually stochastic distribution of the local features of the input sample. The chaos mosaic is fast. For synthesizing textures of the same size and comparable quality, our algorithm is orders of magnitude faster than existing algorithms. On a PC we can synthesize a 512 512 texture from a 64 64 sample in just 0.03 second. More importantly, the chaos mosaic facilitates memory efficient texture rendering through procedural texturing. Like traditional solid texture techniques, the chaos mosaic allows us to synthesize and render synthetic textures that, if stored explicitly as textures, would require prohibitively large amount of storage. As an example, we demonstrate that an 100k 100k synthetic texture can be interactively visualized on a modest PC without suffering from latency. Finally, the chaos mosaic can drastically reduce the bandwidth for interactive 3D graphics delivered across the internet.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GANosaic: Mosaic Creation with Generative Texture Manifolds

This paper presents a novel framework for generating texture mosaics with convolutional neural networks. Our method is called GANosaic and performs optimization in the latent noise space of a generative texture model, which allows the transformation of a content image into a mosaic exhibiting the visual properties of the underlying texture manifold. To represent that manifold, we use a state-of...

متن کامل

Texture Synthesis using TSVQ and Target Re-synthesis

This paper presents a simple texture synthesis method that is fast, efficient, and optimized. Given an input texture, the algorithm will synthesize a texture image of specified size by matching output image pixel neighborhoods with input pixel neighborhoods. The pixel-neighborhood matching will be aided by the use of a TreeStructured Vector Quantization (TSVQ) method which will allow the algori...

متن کامل

Synthesis of Black and White Textures using the Clonal Mosaic Model

The Clonal Mosaic model [1][2] presented a plausible approach for procedural synthesis of mammalian coat patterns such as the big cats and the giraffe. In this paper we investigate the potential of the model for synthesis of Black&White (BW) patterns. Since BW patterns are not biologically developed in the same way as the basic yellowbrown type of patterns previously addressed with the Clonal M...

متن کامل

A Fast Texture Synthesis Technique using Spatial Neighborhood

In this technical report, we present a texture synthesis technique that stores all possible histories in memory structure acting as a Finite State Machine. The histories, which are the most probable spatial neighborhood for each pixel or patch, are stored in each state of the FSM. After constructing that structure, the synthesis goes very fast and smooth in a raster scan order. We found that ou...

متن کامل

Novel Path Search Algorithm for Image Stitching and Advanced Texture Tiling

We propose a fast and adjustable sub-optimal path search algorithm for finding minimum error boundaries between overlapping images. The algorithm may serve as an efficient alternative to traditional slow path search algorithms like the dynamical programming. We use the algorithm in combination with novel adaptive blending to stitch image regions. The technique is then exploited in a framework f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000